#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
string ma1[]={"Million","Billion","Thousand","Hundred"};
string ma2[]={"Ten","Twenty","Thirty","Forty","Fifty","Sixty","Seventy","Eighty","Ninety",};
string ma3[]={"Eleven","Twelve","Thirteen","Fourteen","Fifteen","Sixteen","Seventeen","Eighteen","Nineteen",};
string ma4[]={"Zero","One","Two","Three","Four","Five","Six","Seven","Eight","Nine",};
int num[]={1000000000,1000000,1000,100,10,1};
int caldigit(int n){
    int cnt=0;
    while(n){
        n/=10;cnt++;
    }return cnt;
}
class Solution {
public:
    string ans="";
    int tot=0;
    void dfs(int number){
        string temp="";
        for(int i = 0 ; i < 6 ; i ++ ){
            int j=0;
            for(  ;  ; j++ ){
                if( (j+1) * num[i] > number) break;
            }
            int cnt=caldigit(j);
            number-=cnt*num[i];
            if(cnt==0) continue;
            if(cnt>=3) dfs(j);
            if(cnt==1) {
                temp+=string(ma4[cnt]+" ");
            }
            if(cnt==2){
                int pre=cnt/10;
                int en=cnt%10;
                if(pre==1){
                    temp+=string(ma3[en]+" ");
                }
                else{
                    temp+=string(ma2[pre]+" ");
                    if(0!=en) temp+=string(ma4[en]+" ");
                }
            }
            if(i==0){
               temp+=string(ma1[0]+" ");
            }
            if(i==1){
               temp+=string(ma1[1]+" ");
            }
            if(i==2){
               temp+=string(ma1[2]+" ");
            }
            if(i==3){
               temp+=string(ma1[3]+" ");
            }
            if(i==4){

            }
            if(i==5){
                temp+=string(ma4[j]);
            }
        }
        ans+=temp;

    }
    string numberToWords(int number) {
        if(number==0) return "zero";
        ans="";
        dfs(number);
        return ans;
    }
};
int main(void){
    Solution res;
    int number;cin>>number;
    cout<<res.numberToWords(number)<<endl;
   	return 0;
}
